Two-machine open shop problem with controllable processing times
نویسندگان
چکیده
منابع مشابه
Two machine mixed shop scheduling problem with controllable machine speeds
This paper considers a scheduling problem in which the objective is to determine an optimal machine speed pair and an optimal schedule. There are two machines A, B and n jobs each of which consists of two operations. One operation is to be processed on machine A and the other on machine B. All jobs are open shop type, i.e., processing order of two operations is not specified and so processing o...
متن کاملA Flexible Job Shop Scheduling Problem with Controllable Processing Times to Optimize Total Cost of Delay and Processing
In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexibl...
متن کاملSINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملAn optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
This paper deals with a two-machine open shop scheduling problem. The objective is to minimize the makespan. Jobs arrive over time. We study preemptionresume model, i.e., the currently processed job may be preempted at any moment in necessary and be resumed some time later. Let p1, j and p2, j denote the processing time of a job J j on the two machines M1 and M2, respectively. Bounded processin...
متن کاملa flexible job shop scheduling problem with controllable processing times to optimize total cost of delay and processing
in this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. the main idea is that the processing times of operations may be controlled by consumptions of additional resources. the purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. the proposed model, flexibl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2007
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2006.10.010